Vernacular Programming: General Recursion
نویسنده
چکیده
This paper provides a mathematical analysis of the relationship between vernacular and for-malised derivations of programs; in particular, when the vernacular derivations deploy general recursion. We introduce a calculus VPD to represent vernacular derivations and a constructive theory of operations and types, EOT , to represent formal derivations. We provide an intensional semantics for VPD within EOT which we show is intensionally adequate: it preserves computations up to the intensional eqality of EOT. As a corollary we conclude that all well-formed VPD derivations are sound: they meet their speciications.
منابع مشابه
Edmonds Fukuda Rule and a General Recursion for Quadratic Programming
AND A GENERAL RECURSION FOR QUADRATIC PROGRAMMING Komei Fukuda Tam as Terlaky Dept.of Inf.S i. Dept. of O.R. Tokyo Inst.of Te h. E otv os University 2-12-1 Oh-Okayama 1088.Budapest Meguro-ku, Tokyo 152. Muzeum krt.6-8. JAPAN HUNGARY Abbreviated title: A nite algorithmi framework and E-F rule for QP.
متن کاملRecursion Schemes for Dynamic Programming
Dynamic programming is an algorithm design technique, which allows to improve efficiency by avoiding re-computation of identical subtasks. We present a new recursion combinator, dynamorphism, which captures the dynamic programming recursion pattern with memoization and identify some simple conditions when functions defined by structured general recursion can be redefined as a dynamorphism. The ...
متن کاملIntroducing a Lightweight Structural Model via Simulation of Vernacular “Pa Tu Pa” Arch
The knowledge of Iranian vernacular structures is based on geometry, and there is a possibility of recreating such structural patterns aimed at producing movable structures. The purpose of this research was to utilize the patterns of vernacular structures to provide a lightweight structural model. The questions raised included how to create various forms based on the structural history of any r...
متن کاملA Classification of Viruses Through Recursion Theorems
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose definitions are based on Kleene’s second recursion theorem. We introduce a notion of delayed recursion that we apply to both Kleene’s second recursion theorem and Smullyan’s double recursion theorem. This leads us to define four classes of viruses, two of them being polymorphic. The...
متن کاملThe Clocks Are Ticking: No More Delays! Reduction Semantics for Type Theory with Guarded Recursion
Guarded recursion in the sense of Nakano allows general recursive types and terms to be added to type theory without breaking consistency. Recent work has demonstrated applications of guarded recursion such as programming with codata, reasoning about coinductive types, as well as constructing and reasoning about denotational models of general recursive types. Guarded recursion can also be used ...
متن کامل